0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n103.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 15:57:24 CST 2018
0.00/0.20	% done 4 iterations in 0.003s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(cBLEDSOE5, conjecture,
0.00/0.20	  (cP(f(b)) => (?[Xs,A:($i > $o)]: (A(f(Xs)) & (![Xx]: (A(Xx) => cP(Xx))))))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (cP(f(b)) => (?[Xs,A:($i > $o)]: (A(f(Xs)) & (![Xx]: (A(Xx) => cP(Xx)))))))).
0.00/0.20	tff('0', plain, cP(f(b)), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('1', plain, ![X0 : $i > $o, X1]: (~ X0(f(X1)) | X0(sk_Xx(X0))),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain,
0.00/0.20	    ![X0 : $i > $o, X1, X2 : $i > $o]:
0.00/0.20	      (X2 != X0 | ~ X0(f(X1)) | X0(sk_Xx(X2))),
0.00/0.20	    inference('ho.purify_applied_variable', [status(thm)], ['1'])).
0.00/0.20	tff('3', plain, ![X0 : $i > $o]: (~ $true | cP(sk_Xx(X0)) | X0 != cP),
0.00/0.20	    inference('sup-', [status(thm)], ['0', '2'])).
0.00/0.20	tff('4', plain, ![X0 : $i > $o]: (X0 != cP | cP(sk_Xx(X0))),
0.00/0.20	    inference('simplify', [status(thm)], ['3'])).
0.00/0.20	tff('5', plain, ![X0 : $i > $o, X1]: (~ X0(f(X1)) | ~ cP(sk_Xx(X0))),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('6', plain,
0.00/0.20	    ![X0 : $i > $o, X1, X2 : $i > $o]:
0.00/0.20	      (X2 != X0 | ~ X0(f(X1)) | ~ cP(sk_Xx(X2))),
0.00/0.20	    inference('ho.purify_applied_variable', [status(thm)], ['5'])).
0.00/0.20	tff('7', plain, ![X0 : $i > $o]: (~ $true | ~ cP(sk_Xx(X0)) | X0 != cP),
0.00/0.20	    inference('sup-', [status(thm)], ['0', '6'])).
0.00/0.20	tff('8', plain, ![X0 : $i > $o]: (X0 != cP | ~ cP(sk_Xx(X0))),
0.00/0.20	    inference('simplify', [status(thm)], ['7'])).
0.00/0.20	tff('9', plain, ![X0 : $i > $o]: X0 != cP,
0.00/0.20	    inference('clc', [status(thm)], ['4', '8'])).
0.00/0.20	tff('10', plain, $false, inference('eq_res', [status(thm)], ['9'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.21	EOF
